Towards a Network Description of Interbank Payment Flows
نویسندگان
چکیده
منابع مشابه
A competitive multi-agent model of interbank payment systems
We develop a dynamic multi-agent model of an interbank payment system where banks choose their level of available funds on the basis of private payoff maximisation. The model consists of the repetition of a simultaneous move stage game with incomplete information, incomplete monitoring, and stochastic payoffs. Adaptation takes place with Bayesian updating, with banks maximizing immediate payoff...
متن کاملImperfect Competition and the Pricing of Interbank Payment Services
I n a modern economy, a large fraction of payments for goods and services involve the services of one or more banks. The provision of payment services is, in fact, one of the distinguishing characteristics of banks. A bank-intermediated payment instrument, such as a check, typically communicates instructions to the buyer’s bank to make payment to the seller or the seller’s bank. Often, then, we...
متن کاملIlliquidity in the Interbank Payment System following Wide-Scale Disruptions
We show how the interbank payment system can become illiquid following wide-scale disruptions. Two forces are at play in such disruptions—operational problems and changes in participants’ behavior. We model the interbank payment system as an n-player game and utilize the concept of a potential function to describe the process by which one of multiple equilibria emerges after a wide-scale disrup...
متن کاملA dynamic network model for interbank market
In this paper, a dynamic network model based on agent behavior is introduced to explain the formationmechanismof interbankmarket network.We investigate the impact of credit lending preference on interbank market network topology, the evolution of interbank market network and stability of interbank market. Experimental results demonstrate that interbank market network is a small-world network an...
متن کاملModeling of Partial Digest Problem as a Network flows problem
Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2008
ISSN: 1556-5068
DOI: 10.2139/ssrn.1207922